On the expressibility of copyless cost register automata

نویسندگان

  • Filip Mazowiecki
  • Cristian Riveros
چکیده

Cost register automata (CRA) were proposed by Alur et all as an alternative model for weighted automata. In hope of finding decidable subclasses of CRA, they proposed to restrict their model with the copyless restriction but nothing is really know about the structure or properties of this new computational model called copyless CRA. In this paper we study the properties and expressiveness of copyless CRA. We propose a normal form for copyless CRA and we study the properties of a special group of registers (called stable registers). Furthermore, we find that copyless CRA do not have good closure properties since we show that they are not closed under reverse operation. Finally, we propose a subclass of copyless CRA and we show that this subclass is closed under regular-lookahead.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 1 50 4 . 01 70 9 v 1 [ cs . F L ] 7 A pr 2 01 5 On the expressibility of copyless cost register automata

Cost register automata (CRA) were proposed by Alur et all as an alternative model for weighted automata. In hope of finding decidable subclasses of CRA, they proposed to restrict their model with the copyless restriction but nothing is really know about the structure or properties of this new computational model called copyless CRA. In this paper we study the properties and expressiveness of co...

متن کامل

Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties

Cost register automata (CRA) and its subclass, copyless CRA, were recently proposed by Alur et al. as a new model for computing functions over strings. We study structural properties, expressiveness, and closure properties of copyless CRA. We show that copyless CRA are strictly less expressive than weighted automata and are not closed under reverse operation. To find a better class we impose re...

متن کامل

Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata

It is highly desirable for a computational model to have a logic characterization like in the seminal work of Büchi that connects MSO with finite automata. For example, weighted automata are the quantitative extension of finite automata for computing functions over words and they can be naturally characterized by a subfragment of weighted logic introduced by Droste and Gastin. Recently, cost re...

متن کامل

On Streaming String Transducers and HDT0L Systems

Copyless streaming string transducers (copyless SST) have been introduced by R. Alur and P. Cerny in 2010 as a one-way deterministic automata model to define transformations of finite strings. Copyless SST extend deterministic finite state automata with a set of registers in which to store intermediate output strings, and those registers can be combined and updated all along the run, in a linea...

متن کامل

Better Complexity Bounds for Cost Register Automata

Cost register automata (CRAs) are one-way finite automata whose transitions have the side effect that a register is set to the result of applying a state-dependent semiring operation to a pair of registers. Here it is shown that CRAs over the tropical semiring (N∪{∞},min,+) can simulate polynomial time computation, proving along the way that a naturally defined width-k circuit value problem ove...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1504.01709  شماره 

صفحات  -

تاریخ انتشار 2015